Exploring behavioural patterns during complex problem-solving

In this explorative study, we investigate how sequences of behaviour are related to success or failure in complex problem-solving (CPS). To this end, we analysed log data from two different tasks of the problem-solving assessment of the Programme for International Student Assessment 2012 study (n = 30,098 students). We first coded every interaction of students as (initial or repeated) exploration, (initial or repeated) goal-directed behaviour, or resetting the task. We then split the data according to task successes and failures. We used full-path sequence analysis to identify groups of students with similar behavioural patterns in the respective tasks. Double-checking and minimalistic behaviour was associated with success in CPS, while guessing and exploring task-irrelevant content was associated with failure. Our findings held for both tasks investigated, from two different CPS measurement frameworks. We thus gained detailed insight into the behavioural processes that are related to success and failure in CPS.     

Literature Listing

The quarterly Literature Listing is intended as a current awareness service for readers indicating newly published books, journal and conference articles on: patent search techniques, databases, analysis and classifications; patent searcher certification; patents relating to a) life sciences and pharmaceuticals and b) software; patent policy and strategic issues; trade marks; designs; domain names; and articles reviewing historical aspects of intellectual property or reviewing specific topics/persons. The current Literature Listing was compiled end-November 2019. Key resources used are Scopus, Digital Commons, publishers’ RSS feeds, and serendipity! Please feel free to send the author details of newly published reports/monographs/books for potential inclusion.     

大数据环境下基于K中心点优化算法的Web服务组合

在当前Web服务海量增加、现有Web服务选择算法低效、用户匹配度差的基础上，针对K中心点算法存在的质点偏移、准确率低和容易发生畸变等问题，提出一种大数据环境下基于K中心点优化算法的Web服务组合方法。该方法是在大数据环境下，根据不同用户需求满意度及Web服务QoS参数，对基于优化初始聚类中心的K中心点算法的Web服务选择及最优Web服务组合进行研究。同时针对不同的选择方法对服务动态选择及组合的准确度、迭代更新次数、候选集选择时间及选择总时间进行实验分析，验证了本文研究方法的有效性和可靠性。     

面向连续查询的敏感语义位置隐私保护方案

针对连续查询位置服务中构造匿名区域未考虑语义位置信息导致敏感隐私泄露问题，通过设计[(K,θ)]-隐私模型，提出一种路网环境下面向连续查询的敏感语义位置隐私保护方案。该方案利用Voronoi图将城市路网预先划分为独立的Voronoi单元，依据用户的移动路径和移动速度，选择具有相似特性的其他[K-1]个用户，构建匿名用户集；利用匿名用户集用户设定的敏感语义位置类型和语义安全阈值，以及用户所处语义位置的Voronoi单元，构建满足[(K,θ)]-隐私模型的语义安全匿名区域，可以同时防止连续查询追踪攻击和语义推断攻击。实验结果表明，与SCPA算法相比，该方案在隐私保护程度上提升约15%，系统开销上降低约20%。     

钓鱼网站检测研究现状与发展趋势的计量分析

从包含相关SCI、CPCI-S与BKCI-S等数据库的Web of Science核心合集数据库出发，对数据库中存在的近13年的国内外文献使用Cite Space与Carrot2分析工具进行聚类分析。力求系统客观地得到国际上钓鱼网站检测技术研究领域的关注热点、研究脉络、著名机构以及核心刊物等研究现状。筛选出具有代表性的文章，采取少量顶级文章精读、部分知名文章粗读的方式对目前钓鱼网站检测技术所涉及到的方法做整理与归类。根据上文的分析对钓鱼网站检测技术的发展方向做了规律性展望，以求对此方向下相关研究人员的研究提供一定的参考。     

面向智能客服系统的情感分析技术

该文以阿里小蜜为例,对智能客服系统中的情感分析技术进行比较全面的介绍,包括情感分析算法模型的原理及其在智能客服系统的多个应用场景中的实际落地使用方式和效果分析。智能客服在解决客户高频业务问题的同时,也需要给客户提供多维度的、具有类人能力的助理、导购、语聊和娱乐等服务,提高客户对智能客服机器人的整体满意度。在此过程中,情感分析技术在机器人类人能力建设中起到了至关重要的作用。该文围绕智能客服系统中人机结合的服务形式,从六个维度总结和介绍了情感分析技术在智能客服系统中的应用场景,包括用户情感检测、用户情感安抚、情感生成式语聊、客服服务质检、会话满意度预估和智能人工入口。     

基于“动态学习数据分析”的智慧课堂 评价考核体系构建

This paper firstly describes the current situation and limitations of learning evaluation and assessment in colleges and uni- versities; then, it analyzes the possibility of implementing the learning evaluation and assessment based on "dynamic learning data analysis"; then, it describes the design process of the learning evaluation and assessment system in detail; finally, it determines the various assessment items and carries out quantitative processing to better apply them to actual teaching.     

Anderson Acceleration for Nonconvex ADMM Based on Douglas-Rachford Splitting

The alternating direction multiplier method (ADMM) is widely used in computer graphics for solving optimization problems that can be nonsmooth and nonconvex. It converges quickly to an approximate solution, but can take a long time to converge to a solution of high-accuracy. Previously, Anderson acceleration has been applied to ADMM, by treating it as a fixed-point iteration for the concatenation of the dual variables and a subset of the primal variables. In this paper, we note that the equivalence between ADMM and Douglas-Rachford splitting reveals that ADMM is in fact a fixed-point iteration in a lower-dimensional space. By applying Anderson acceleration to such lower-dimensional fixed-point iteration, we obtain a more effective approach for accelerating ADMM. We analyze the convergence of the proposed acceleration method on nonconvex problems, and verify its effectiveness on a variety of computer graphics including geometry processing and physical simulation.     

高炉灰中未燃煤粉含量检测方法研究

为提高高炉灰中未燃煤粉含量的检测效率及准确性,提出了一种矿相分析和化学成分分析相结合的新型检测方法。该方法利用研磨样代替镶嵌样,并用高炉灰化学成分分析对矿相分析进行验证。结果表明:铁与未燃煤粉含量的检测结果标准差分别为1.01%和0.62%,小于统计学的规定要求,说明该新型检测方法准确性良好。     

Persistence Analysis of Multi-scale Planar Structure Graph in Point Clouds

Modern acquisition techniques generate detailed point clouds that sample complex geometries. For instance, we are able to produce millimeter-scale acquisition of whole buildings. Processing and exploring geometrical information within such point clouds requires scalability, robustness to acquisition defects and the ability to model shapes at different scales. In this work, we propose a new representation that enriches point clouds with a multi-scale planar structure graph. We define the graph nodes as regions computed with planar segmentations at increasing scales and the graph edges connect regions that are similar across scales. Connected components of the graph define the planar structures present in the point cloud within a scale interval. For instance, with this information, any point is associated to one or several planar structures existing at different scales. We then use topological data analysis to filter the graph and provide the most prominent planar structures. Our representation naturally encodes a large range of information. We show how to efficiently extract geometrical details (e.g. tiles of a roof), arrangements of simple shapes (e.g. steps and mean ramp of a staircase), and large-scale planar proxies (e.g. walls of a building) and present several interactive tools to visualize, select and reconstruct planar primitives directly from raw point clouds. The effectiveness of our approach is demonstrated by an extensive evaluation on a variety of input data, as well as by comparing against state-of-the-art techniques and by showing applications to polygonal mesh reconstruction.